Cost-Effective Clustering

Small Beowulf clusters can effectively serve as personal or group supercomputers. In such an environment, a cluster can be optimally designed for a specific problem (or a small set of codes). We discuss how theoretical analysis of the code and benchmarking on similar hardware lead to optimal systems.Comment: 7 pages, 2 figures (one in color). Color version of paper to be published as part of proceedings of CCP2000 (Brisbane) in a special isssue of Computer Physics Communication

Cost of dynamical quark simulations with improved staggered quarks

The cost of dynamical quark simulations with improved staggered quarks is estimated based on current and planned running by the MILC collaboration. I find that a few 10s of Teraflop years should be sufficient to calculate down to a lattice spacing of 0.045 fm.Comment: Lattice2001(plenary) 3 pages, includes hep-lat references not in published versio

Benchmarking and tuning the MILC code on clusters and supercomputers

Recently, we have benchmarked and tuned the MILC code on a number of architectures including Intel Itanium and Pentium IV (PIV), dual-CPU Athlon, and the latest Compaq Alpha nodes. Results will be presented for many of these, and we shall discuss some simple code changes that can result in a very dramatic speedup of the KS conjugate gradient on processors with more advanced memory systems such as PIV, IBM SP and Alpha.Comment: Lattice2001(algorithms) 4 pages, includes hep-lat references not in published versio

Diquark Representations for Singly Heavy Baryons with Light Staggered Quarks

In the staggered fermion formulation of lattice QCD, we construct diquark operators which are to be embedded in singly heavy baryons. The group theoretical connections between continuum and lattice staggered diquark representations are established.Comment: v1, 13 pages with title "Staggered Diquarks for Singly Heavy Baryons"; v2, 4 pages in revtex, changed the title to be more specifi